منابع مشابه
Induced label graphoidal graphs
Let G be a non-trivial, simple, finite, connected and undirected graph of order n and size m. An induced acyclic graphoidal decomposition (IAGD) of G is a collection ψ of non-trivial and internally disjoint induced paths in G such that each edge of G lies in exactly one path of ψ. For a labeling f : V → {1, 2, 3, . . . , n}, let ↑ Gf be the directed graph obtained by orienting the edges uv of G...
متن کاملOn Graphoidal Covers of Bicyclic Graphs
A graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths in G such that every path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ and every edge of G is in exactly one path in ψ. The minimum cardinality of a graphoidal cover of G is called the graphoidal covering number of G and is denoted by η(G) or η. Also, If every me...
متن کاملon label graphoidal covering number-i
let $g=(v, e)$ be a graph with $p$ vertices and $q$ edges. an emph{acyclic graphoidal cover} of $g$ is a collection $psi$ of paths in $g$ which are internally-disjoint and cover each edge of the graph exactly once. let $f: vrightarrow {1, 2, ldots, p}$ be a bijective labeling of the vertices of $g$. let $uparrow!g_f$ be the directed graph obtained by orienting the...
متن کاملInduced Graphoidal Covers in a Graph
An induced graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths in G such that every path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, every edge of G is in exactly one path in ψ and every member of ψ is an induced cycle or an induced path. The minimum cardinality of an induced graphoidal cover of G is called the in...
متن کاملInduced Acyclic Graphoidal Covers in a Graph
An induced acyclic graphoidal cover of a graph G is a collection ψ of open paths in G such that every path in ψ has atleast two vertices, every vertex of G is an internal vertex of at most one path in ψ, every edge of G is in exactly one path in ψ and every member of ψ is an induced path. The minimum cardinality of an induced acyclic graphoidal cover of G is called the induced acyclic graphoida...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Universitatis Sapientiae, Informatica
سال: 2014
ISSN: 2066-7760
DOI: 10.1515/ausi-2015-0002